Project Progress Report

I have finished implementation of some traditional texture synthesis algorithms: pixel-based [EL99] and patch-based [EF01]. The first one, as well known is quite slow. I tested some perspective texture samples with these algorithms, as shown in Fig 1 and Fig 2. It is obvious that the textures of different scales are mixed together. This is just a shortcoming of traditional algorithms. I have nearly finished the implementation for: acceleration method based on tree-structure of [WL00] and [HB95]; and acceleration based on [Ash01]’s neighborhood heuristic. For the first one, almost everything is ready, just simple debug is needed. But instead of the TSVQ used in the two papers, I will use the ANN (approximate nearest neighborhood) to accelerate the algorithm. It is still an KD-tree based structure and its per-search time complexity is still O(lg n). For the second one, its implementation structure is a simple extension of [EL99], so there is not much difficulty.